Solving railroad blocking problem using ant colony optimization algorithm
نویسندگان
چکیده
منابع مشابه
Solving the Airline Recovery Problem By Using Ant Colony Optimization
In this paper an Ant Colony (ACO) algorithm is developed to solve aircraft recovery while considering disrupted passengers as part of objective function cost. By defining the recovery scope, the solution always guarantees a return to the original aircraft schedule as soon as possible which means least changes to the initial schedule and ensures that all downline affects of the disruption are ...
متن کاملSolving Traveling Salesman Problem through Optimization Techniques Using Genetic Algorithm and Ant Colony Optimization
Swarm robotic is a new research area in the domain of Artificial intelligence. Particularly, the swarm robot concept is adopted from Mother Nature that combines small robots in a group to solve a particular problem. This work presents decentralization of swarm robots along-with their methods of optimization, development, applications and implementation in real life domain. It also solves the tr...
متن کاملA population-based algorithm for the railroad blocking problem
Railroad blocking problem (RBP) is one of the problems that need an important decision in freight railroads. The objective of solving this problem is to minimize the costs of delivering all commodities by deciding which inter-terminal blocks to build and by specifying the assignment of commodities to these blocks, while observing limits on the number and cumulative volume of the blocks assemble...
متن کاملAnt Colony Optimization Algorithm
Hybrid algorithm is proposed to solve combinatorial optimization problem by using Ant Colony and Genetic programming algorithms. Evolutionary process of Ant Colony Optimization algorithm adapts genetic operations to enhance ant movement towards solution state. The algorithm converges to the optimal final solution, by accumulating the most effective sub-solutions.
متن کاملAnt Colony Optimization for Solving Traveling Salesman Problem
An ant colony capable of solving the traveling salesman problem (TSP). TSP is NP-hard problem. Even though the problem itself is simple, when the number of city is large, the search space will become extremely large and it becomes very difficult to find the optimal solution in a short time. One of the main ideas of ant algorithms is the indirect communication of a colony of agents, called (arti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2011
ISSN: 0307-904X
DOI: 10.1016/j.apm.2011.05.018